ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms

نویسندگان

  • Jérémie Humeau
  • Arnaud Liefooghe
  • El-Ghazali Talbi
  • Sébastien Vérel
چکیده

This document presents a general-purpose software framework dedicated to the design, the analysis and the implementation of local search algorithms: ParadisEO-MO. A substantial number of single-solution based local search metaheuristics has been proposed so far, and an attempt of unifying existing approaches is here presented. Based on a fine-grained decomposition, a conceptual model is proposed and is validated by regarding a number of state-of-the-art methodologies as simple variants of the same structure. This model is then incorporated into the ParadisEO-MO software framework. This framework has proven its efficiency and high flexibility by enabling the resolution of many academic and real-world optimization problems from science and industry. Key-words: local search; metaheuristic; fitness landscapes; conceptual unified model; algorithm design, analysis and implementation; software framework ∗ École des Mines de Douai, département IA, 941 rue Charles Bourseul, BP 10838, 59508 Douai, France ([email protected]) † Université Lille 1, Laboratoire LIFL, UMR CNRS 8022, Cité scientifique, Bât. M3, 59655 Villeneuve d’Ascq cedex, France ([email protected]) ‡ Université Lille 1, Laboratoire LIFL, UMR CNRS 8022, Cité scientifique, Bât. M3, 59655 Villeneuve d’Ascq cedex, France ([email protected]) § Université Nice Sophia Antipolis, Laboratoire I3S, UMR CNRS 6070, 2000 route des Lucioles, BP 121, 06903 Sophia Antipolis cedex, France ([email protected]) ha l-0 06 65 42 1, v er si on 2 4 Ju n 20 13 ParadisEO-MO: De l’analyse du paysage de fitness à des algorithmes de recherche locale efficaces Résumé : Ce document présente une plateforme logicielle polyvalente dédiée à la conception, l’analyse et l’implémentation d’algorithmes de recherche locale: ParadisEO-MO. Un nombre substantiel de métaheuristiques basées sur une solution unique a été proposé jusqu’à présent, et une tentative d’unifier les approches existantes est ici présentée. Basé sur une décomposition fine, un modèle conceptuel est proposé et validé par l’instantiation d’un grand nombre de méthodologies classiques comme des variantes simples de la même structure. Ce modèle est ensuite incorporé dans la plateforme logicielle ParadisEO-MO. Cette plateforme a prouvé son efficacité et sa grande flexibilité en permettant la résolution de nombreux problèmes d’optimisation académiques et du monde réel, des domaines de la science et de l’industrie. Mots-clés : recherche locale; métaheuristique; paysages de fitness; modèle conceptuel unifié; conception, analyse et implémentation d’algorithmes; plateforme logicielle ha l-0 06 65 42 1, v er si on 2 4 Ju n 20 13

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Introduction to Fitness Landscape Analysis and Cost Models for Local Search

Despite their empirical effectiveness, our theoretical understanding of metaheuristic algorithms based on local search (and all other paradigms) is very limited, leading to significant problems for both researchers and practitioners. Specifically, the lack of a theory of local search impedes the development of more effective metaheuristic algorithms, prevents practitioners from identifying the ...

متن کامل

Fitness Landscape Analysis for Dynamic Resource Allocation in Multiuser OFDM Based Cognitive Radio Systems

Cognitive Radio (CR) is a promising technique for improving the spectrum efficiency in future wireless network. The downlink transmission in a multiuser Orthogonal Frequency Division Modulation (MU-OFDM) based CR system is investigated. Optimal allocating transmit power, bits and subcarriers among cognitive radio users (CRUs) can achieve high throughput while satisfying the given quality of ser...

متن کامل

An iterative local search approach based on fitness landscapes analysis for the delay-constrained multicast routing problem

This paper presents the first fitness landscape analysis on the delay-constrained least-cost multicast routing problem (DCLC-MRP), a well-known NP-hard problem. Although the problem has attracted an increasing research attention over the past decade in telecommunications and operational research, little research has been conducted to analyze the features of its underlying landscape. Two of the ...

متن کامل

Fitness Landscape Analysis of Hyper-Heuristic Transforms for the Vertex Cover Problem

Hyper-heuristics have recently proved efficient in several areas of combinatorial search and optimization, especially scheduling. The basic idea of hyperheuristics is based on searching for search-strategy. Instead of traversing the solution-space, the hyper-heuristic traverses the space of algorithms to find or construct an algorithm best suited for the given problem instance. The observed eff...

متن کامل

Characterising fitness landscapes with fitness-probability cloud and its applications to algorithm configuration

Metaheuristics are approximation optimisation techniques widely applied to solve complex optimisation problems. Since metaheuristics are general algorithmic frameworks, a metaheuristic algorithm can have many variants if different configurations (e.g., choice of search operator, numerical parameters, etc.) are applied. In particular, it is widely acknowledged that finding good algorithm configu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Heuristics

دوره 19  شماره 

صفحات  -

تاریخ انتشار 2013